204B - Little Elephant and Cards - CodeForces Solution


binary search data structures *1500

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using namespace std;

int main() {
ios_base::sync_with_stdio(0);
unordered_set<int> st;
unordered_map<int, int> aa, bb;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
aa[a]++;
if (a != b) bb[b]++;
st.insert(a);
st.insert(b);
}
int ans = 1e9;
for (auto i: st) {
if (aa[i] >= n/2+n%2) {
ans = 0;
} else if (aa[i] + bb[i] >= n/2+n%2) {
ans = min(ans, n/2+n%2 - aa[i]);
}
}
if (ans == 1e9) cout << "-1\n";
else cout << ans << '\n';
}


Comments

Submit
0 Comments
More Questions

1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram
993A - Two Squares
1659D - Reverse Sort Sum
1659A - Red Versus Blue
1659B - Bit Flipping
1480B - The Great Hero
1519B - The Cake Is a Lie
1659C - Line Empire
515A - Drazil and Date
1084B - Kvass and the Fair Nut
1101A - Minimum Integer
985D - Sand Fortress
1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading